Transition network grammars for natural language analysis
نویسندگان
چکیده
منابع مشابه
GwB, A Workbench for Natural Language Grammars
The files are stored in Postscript, in compressed (gzip) form, with the report number as filename. Alternatively, reports are available by post from the above address. Abstract In this report we present a workbench for natural language grammars which was designed as a computational tool to help verifying the theoretical consistency and the empirical adequacy of syntactic and semantic analysis o...
متن کاملAssumption Grammars for Processing Natural Language
In this paper we examine three natural language uses of a recently developed logic grammar formalism-Assumption Grammars-particularly suitable for hypothetical reasoning. They are based on intuitionistic and linear implications scoped over the current continuation, which allows us to follow given branches of the computation under hypotheses that disappear when and if backtracking takes place. W...
متن کاملNatural Language Agreement Description for Reversible Grammars
The paper presents a very general method to describe the agreement in the natural languages. The method can be used in automatic translation. It allows the analysis of a text and then the generation of the text in target language so it can be embeded in the reversible grammars. It allows also in the case of analysis the treatment of the agreement errors. The method is based on a set of simple e...
متن کاملDefining Natural Language Grammars in GPSG
1 Overview Three central goals of work in the generalized phrase structure grammar (GPSG) linguistic framework, as stated in the leading book "Generalized Phrase Structure Grammar" Gaz-dar et al (1985) (hereafter GKPS), are: (1) to characterize all and only the natural language grammars, (2) to algorithmically determine membership and generative power consequences of GPSGs, and (3) to embody th...
متن کاملLearning unification-based natural language grammars
Practical text processing systems need wide covering grammars. When parsing unrestricted language, such grammars often fail to generate all of the sentences that humans would judge to be grammatical. This problem undermines successful parsing of the text and is known as undergeneration. There are two main ways of dealing with undergeneration: either by sentence correction, or by grammar correct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1970
ISSN: 0001-0782,1557-7317
DOI: 10.1145/355598.362773